Ranking and Necessity: The Fusional Reduction Algorithm
نویسندگان
چکیده
Understanding a linguistic theory within OT requires an exact characterization of the ranking conditions necessitated by data. These conditions determine the formal shape of the grammar while providing the crucial link between the data and its interpretation. We introduce an algorithm (‘Fusional Reduction’, FRed) which calculates the necessary and sufficient ranking conditions inherent in any collection of candidates and presents them in a maximally concise and informative way. The algorithm, stemming from the original proposal of Brasoveanu 2003, is set within the fusional ERC theory of Prince 2002a. In this context, the Most Informative Basis and the Skeletal Basis emerge as the two important types of reduced representations of ranking structure. We examine their properties and show how FRed produces them from data. Fine-grained FRed is compared with broad-stroke RCD (Tesar & Smolensky 1993, Tesar 1995 et seq.), and RCD is re-interpreted and embraced within FRed as a simplified, information-losing sub-case. Finally, FRed is compared with other related algorithms in structure, worst-case complexity, and relevance to the analytical enterprise. This paper revises Brasoveanu & Prince 2005
منابع مشابه
No More than Necessary Beyond the ‘ Four Rules ’ , and a Bug Report
After proposing four ‘rules of inference’ to be used in the program OTSoft for simplifying collections of ranking arguments, Hayes 1997 implicitly raises the question of whether these rules suffice. In this note, the simplification goal is spelled out within the analytical framework of Prince 2002a and Brasoveanu & Prince 2005, in prep. and the question is settled (negatively). A broader genera...
متن کاملClustering and Ranking University Majors using Data Mining and AHP algorithms: The case of Iran
Abstract: Although all university majors are prominent and the necessity of their presences is of no question, they might not have the same priority basis considering different resources and strategies that could be spotted for a country. This paper focuses on clustering and ranking university majors in Iran. To do so, a model is presented to clarify the procedure. Eight different criteria are ...
متن کاملThe Evaluation of the Team Performance of MLB Applying PageRank Algorithm
Background. There is a weakness that the win-loss ranking model in the MLB now is calculated based on the result of a win-loss game, so we assume that a ranking system considering the opponent’s team performance is necessary. Objectives. This study aims to suggest the PageRank algorithm to complement the problem with ranking calculated with winning ratio in calculating team ranking of US MLB. ...
متن کاملKinetic Mechanism Reduction Using Genetic Algorithms, Case Study on H2/O2 Reaction
For large and complex reacting systems, computational efficiency becomes a critical issue in process simulation, optimization and model-based control. Mechanism simplification is often a necessity to improve computational speed. We present a novel approach to simplification of reaction networks that formulates the model reduction problem as an optimization problem and solves it using geneti...
متن کامل